例句與造句

1. See polynomial greatest common divisor # B閦out's identity and extended GCD algorithm for details.
2. For example, the computation of polynomial greatest common divisors is systematically used for the simplification of expressions involving fractions.
3. See Polynomial long division, Polynomial greatest common divisor # Euclidean division and Polynomial greatest common divisor # Pseudo-remainder sequences.
4. See Polynomial long division, Polynomial greatest common divisor # Euclidean division and Polynomial greatest common divisor # Pseudo-remainder sequences.
5. A typical example of this kind of work is the computation of polynomial greatest common divisors, which is required to simplify fractions.
6. It's difficult to find polynomial greatest common divisor in a sentence. 用polynomial greatest common divisor造句挺難的
7. It is used by the most efficient implementations of polynomial greatest common divisor, exact linear algebra and Gr鯾ner basis algorithms over the integers and the rational numbers.
8. "' Extended Euclidean algorithm "'also refers to a very similar algorithm for computing the polynomial greatest common divisor and the coefficients of B閦out's identity of two univariate polynomials.
9. This equivalence is also used for computing reduced form of many fractions, and this makes the Euclidean algorithm less efficient than algorithms which work only with polynomials over the integers ( see Polynomial greatest common divisor ).
10. Two important and related problems in algebra are the factorization of polynomials, that is, expressing a given polynomial as a product of other polynomials that can not be factored any further, and the computation of polynomial greatest common divisors.